In-Place Random List Permutations
نویسندگان
چکیده
We give two algorithms to randomly permute a linked list of length n in place using O(n logn) time and O(logn) stack space in both the expected case and the worst case. The first algorithm uses well-known sequential random sampling, and the second uses inverted sequential random sampling. 1999 Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Random permutations and their discrepancy process
On the one hand, random permutations appear as a natural model for data in various topics, such as analysis of algorithms, statistical mechanics, or genomic statistics. On the other hand, from the mathematical point of view, various parameters of random permutations have been studied in combinatorics and probability, like the distribution of the lengths of cycles, the repartition of the eigenva...
متن کاملThe Last Descent In Samples Of Geometric Random Variables And Permutations
• Skip lists are an alternative to tries and digital search trees. For each data, a geometric random variable defines the number of pointers that it contributes to the data structure. (The data structure is non-deterministic and is randomly constructed using a geometric random variable.) These pointers are then connected in a specific way that makes access to the data manageable. The analysis l...
متن کاملA New Pseudo-Random Number Generator Based on Two Chaotic Maps
A new pseudo-random number generator (PRNG) is proposed. The principle of the method consists in mixing chaotic maps produced from an input initial vector. The algorithm uses permutations whose positions are computed and indexed by a chaotic function based on linear congruences. The performance of this scheme is evaluated through statistical analysis. Such a cryptosystem lets appear significant...
متن کاملIncreasing Subsequences in Nonuniform Random Permutations
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing and decreasing subsequences in non-uniform random permutations.
متن کاملBallot Permutations in Prêt à Voter
Handling full permutations of the candidate list along with re-encryption mixes is rather difficult in Prêt à Voter but handling cyclic shifts is straightforward. One of the versions of Prêt à Voter that uses Paillier encryption allows general permutations of candidates on the ballot, rather than just cyclic shifts. This improves the robustness of the system against an adversary who tries to al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 70 شماره
صفحات -
تاریخ انتشار 1999